Lattice Polymer Automata
نویسنده
چکیده
We present a new style of molecular dynamics and self-assembly simulation, the Lattice Polymer Automaton [LPA]. In the LPA all interactions, including electromagnetic forces, are decomposed and communicated via propagating particles, \photons". The monomer-monomer bond forces, the molecular excluded volume forces, the longer range intermolecular forces, and the polymer-solvent interactions may all be modeled with propagating particles. The LPA approach di ers signi cantly from both of the standard approaches, Monte Carlo lattice methods and Molecular Dynamics simulations. On the one hand, the LPA provides more realism than Monte Carlo methods, because it produces a time series of con gurations of a single molecule, rather than a set of causally unrelated samples from a distribution of con gurations. The LPA can therefore be used directly to study dynamical properties; one can in fact watch polymers move in real time. On the other hand, the LPA is fully discrete, and therefore much simpler than traditional Molecular Dynamics models, which are continuous and operate on much shorter time scales. Due to this simplicity it is possible to simulate longer real time periods, which should enable the study of molecular self-organization on workstations; supercomputers are not needed.
منابع مشابه
Lattice Gas Automata Simulation of Adsorption Process of Polymer in Porous Media
Lattice gas automata (LGA) model is developed to simulate polymer adsorption process by adding some collision rules. The simulation result of the model is matched with batch experiment and compared with accepted isothermal adsorption equations. They show that the model is viable to perform simulation of the polymer adsorption process. The LGA model is then applied for simulating continuous poly...
متن کاملGENERAL FUZZY AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED
The present paper has been an attempt to investigate the general fuzzy automata on the basis of complete residuated lattice-valued ($L$-GFAs). The study has been chiefly inspired from the work by Mockor cite{15, 16, 17}. Regarding this, the categorical issue of $L$-GFAs has been studied in more details. The main issues addressed in this research include: (1) investigating the relationship betwe...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملFUZZY PREORDERED SET, FUZZY TOPOLOGY AND FUZZY AUTOMATON BASED ON GENERALIZED RESIDUATED LATTICE
This work is towards the study of the relationship between fuzzy preordered sets and Alexandrov (left/right) fuzzy topologies based on generalized residuated lattices here the fuzzy sets are equipped with generalized residuated lattice in which the commutative property doesn't hold. Further, the obtained results are used in the study of fuzzy automata theory.
متن کاملCellular Automata Methods in Mathematical Physics Cellular Automata Methods in Mathematical Physics
Cellular automata (CA) are fully discrete, spatially-distributed dynamical systems which can serve as an alternative framework for mathematical descriptions of physical systems. Furthermore, they constitute intrinsically parallel models of computation which can be e ciently realized with special-purpose cellular automata machines. The basic objective of this thesis is to determine techniques fo...
متن کامل